ALGEBRAIC MULTILEVEL ITERATION METHODS AND THE BEST APPROXIMATION TO 1/x IN THE UNIFORM NORM

نویسندگان

  • J. Kraus
  • V. Pillwein
  • L. Zikatanov
  • JOHANNES KRAUS
  • VERONIKA PILLWEIN
  • LUDMIL ZIKATANOV
چکیده

In this note, we provide simple convergence analysis for the algebraic multilevel iteration methods [37, 51]. We consider two examples of AMLI methods with different polynomial acceleration. The first one is based on shifted and scaled Chebyshev polynomial and the other on the polynomial of best approximation to x−1 on a finite interval [λmin , λmax ], 0 < λmin < λmax in the ‖ ·‖∞ norm. The construction of the latter polynomial is of interest by itself, and we have included a derivation of a recurrence relation for computing this polynomial. We have also derived several inequalities related to the error of best approximation, which we applied in the AMLI analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Multilevel Preconditioning in Isogeometric Analysis: Construction and Numerical Studies

We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a uniform mesh on a unit interval, the explicit representation of B-spline basis functions for a fixed mesh size h is given for p = 2, 3, 4 and for C 0-and C ...

متن کامل

Polynomial of Best Uniform Approximation to 1/x and Smoothing in Two-level Methods

We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to x−1 on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic partial differential equation (PDE), where the relaxation on the fine grid uses the aforementioned polynomial of best approximation. Based on a new smoothing proper...

متن کامل

A Bootstrap Algebraic Multilevel Method for Markov Chains

This work concerns the development of an algebraic multilevel method for computing state vectors of Markov chains. We present an efficient bootstrap algebraic multigrid method for this task. In our proposed approach, we employ a multilevel eigensolver, with interpolation built using ideas based on compatible relaxation, algebraic distances, and least squares fitting of test vectors. Our adaptiv...

متن کامل

Robust multilevel methods for quadratic finite element anisotropic elliptic problems

This paper discusses a class of multilevel preconditioners based on approximate block factorization for conforming finite element methods (FEM) employing quadratic trial and test functions. The main focus is on diffusion problems governed by a scalar elliptic partial differential equation (PDE) with a strongly anisotropic coefficient tensor. The proposed method provides a high robustness with r...

متن کامل

On Two Ways of Stabilizing the Hierarchical Basis Multilevel Methods

A survey of two approaches for stabilizing the hierarchical basis (HB) multilevel preconditioners, both additive and multiplicative, is presented. The first approach is based on the algebraic extension of the two-level methods, exploiting recursive calls to coarser discretization levels. These recursive calls can be viewed as inner iterations (at a given discretization level), exploiting the al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009